The Total Acquisition Number of Random Geometric Graphs
نویسندگان
چکیده
منابع مشابه
The Total Acquisition Number of Random Geometric Graphs
Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum cardinality of the set of vertices with positive weight at the end of the process. In this paper, we investigate r...
متن کاملThe Total Acquisition Number of Random Graphs
Let G be a graph in which each vertex initially has weight 1. In each step, the weight from a vertex u to a neighbouring vertex v can be moved, provided that the weight on v is at least as large as the weight on u. The total acquisition number of G, denoted by at(G), is the minimum possible size of the set of vertices with positive weight at the end of the process. LeSaulnier, Prince, Wenger, W...
متن کاملClique number of random geometric graphs
The clique number C of a graph is the largest clique size in the graph. For a random geometric graph of n vertices, taken uniformly at random, including an edge beween two vertices if their distance, taken with the uniform norm, is less than a parameter r on a torus Ta, we find the asymptotic behaviour of the clique number. Setting θ = ( r a ), in the subcritical regime where θ = o( 1 n ), we e...
متن کاملThe Distant-l Chromatic Number of Random Geometric Graphs
A random geometric graph Gn is given by picking n vertices in R d independently under a common bounded probability distribution, with two vertices adjacent if and only if their l-distance is at most rn. We investigate the distant-l chromatic number χl(Gn) of Gn for l ≥ 1. Complete picture of the ratios of χl(Gn) to the chromatic number χ(Gn) are given in the sense of almost sure convergence.
متن کاملOn the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn with vertex set {1, . . . , n} where distinct i and j are adjacent when ‖Xi − Xj‖ ≤ r. Here ‖.‖may be any norm on Rd, and ν may be any probability distribution on Rd with a bounded density function. We consider the chromatic n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6632